Adaptive Hybrid ant colony optimization for solving Dual Resource Constrained Job Shop Scheduling Problem

نویسندگان

  • Jingyao Li
  • Shudong Sun
  • Yuan Huang
چکیده

This paper presents a scheduling approach, based on Ant Colony Optimization (ACO), developed to address the scheduling problem in manufacturing systems constrained by both machines and heterogeneous workers called as Dual Resource Constrained Job Shop Scheduling Problem with Heterogeneous Workers. This hybrid algorithm utilizes the combination of ACO and Simulated Annealing (SA) algorithm and proposes an adaptive control mechanism based on ant flow of route choice to improve the global search ability. Two adaptive adjusting schemes of parameters based on iteration times and quality of solutions respectively are imposed to actualize the performance optimization by stages. Then the performances of different optimization methods with different resource allocation strategies are compared according to simulation experiments on both concrete instance and random benchmarks while related discussion are represented at last.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Bacterial Foraging Algorithm For Solving Job Shop Scheduling Problems

Bio-Inspired computing is the subset of Nature-Inspired computing. Job Shop Scheduling Problem is categorized under popular scheduling problems. In this research work, Bacterial Foraging Optimization was hybridized with Ant Colony Optimization and a new technique Hybrid Bacterial Foraging Optimization for solving Job Shop Scheduling Problem was proposed. The optimal solutions obtained by propos...

متن کامل

Ant Colony Algorithm for Surgery Scheduling Problem

Considering the complete process of surgery including the preoperative and postoperative stages, multiple resource constraints involved and the integration of surgical upstream and downstream resources, surgery scheduling was described as an extended multi-resource constrained flexible job-shop scheduling problem and an optimization approach was proposed based on an improved ant colony algorith...

متن کامل

A Hybrid Algorithm Using Firefly and Cuckoo Search Algorithm for Flexible Open Shop Scheduling Problem

In this paper presents the hybrid algorithm using firefly and a cuckoo search algorithm for flexible open shop scheduling problem. The flexible, open shop scheduling is known to be NP-hard. Cuckoo algorithm (CA) is one of the widely used techniques for constrained optimization. And it gave the best results compared to other algorithms. A disadvantage of cuckoo algorithm though is that they easi...

متن کامل

Generalized Cyclic Open Shop Scheduling and a Hybrid Algorithm

In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...

متن کامل

Ant Colony Optimisation for Job Shop Scheduling

A recent adaptive algorithm, named Ant System, is introduced and used to solve the problem of job shop scheduling. The algorithm was first introduced by Dorigo, Maniezzo and Colorni in 1991 and is derived from the foraging and recruiting behaviour observed in an ant colony. It can be applied to combinatorial optimisation problems. This paper outlines the algorithm’s implementation and performan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSW

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2011